Graph aggregation
نویسندگان
چکیده
منابع مشابه
Graph Aggregation
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference orders), when consolidating conflicting views regarding the relationships between arguments in a de...
متن کاملTopology aggregation for directed graph
This paper addresses the problem of aggregating the topology of a sub-network in a compact way with minimum distortion. The problem arises from networks that have a hierarchical structure , where each sub-network must advertise the cost of routing between each pair of its border nodes. The straightforward solution of advertising the exact cost for each pair has a quadratic cost which is not pra...
متن کاملCollective Rationality in Graph Aggregation
Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the point of view of social choice theory and ask what properties shared by the individual graphs wil...
متن کاملWeighted aggregation for multi-level graph partitioning
Graph partitioning is a technique which is widely used in many fields of computer science and engineering. The goal is to partition the vertices of a graph into a certain number of disjoint sets of approximately the same size, so that a cut metric is minimized. Due to the NP-hardness of the problem and its practical importance, many different heuristics (spectral, combinatorial, evolutionist, e...
متن کاملLocally Boosted Graph Aggregation for Community Detection
Learning the right graph representation from noisy, multi-source data has garnered significant interest in recent years. A central tenet of this problem is relational learning. Here the objective is to incorporate the partial information each data source gives us in a way that captures the true underlying relationships. To address this challenge, we present a general, boosting-inspired framewor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2017
ISSN: 0004-3702
DOI: 10.1016/j.artint.2017.01.001